1426D - Non-zero Segments - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    scanf("%d", &n);
    int l[n];
    for(int i = 0; i < n; i++){
        scanf("%d", l+i);
    }
    int ans = 0;
    map<long long, int> m;
    long long x = 0;
    m[0] = 1;
    for(int i = 0; i < n; i++){
        x += l[i];
        if(m[x]){
            ans++;
            m.clear();
            x = l[i];
            m[0] = 1;
        }
        m[x] = 1;
    }
    printf("%d\n", ans);
}